Connection coefficients and zeros of orthogonal polynomials

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connection coefficients for Laguerre–Sobolev orthogonal polynomials

Laguerre–Sobolev polynomials are orthogonal with respect to an inner product of the form 〈p,q〉S = ∫∞ 0 p(x)q(x)x αe−x dx + λ∫∞ 0 p′(x)q′(x)dμ(x), where α > −1, λ 0, and p,q ∈ P, the linear space of polynomials with real coefficients. If dμ(x) = xαe−x dx, the corresponding sequence of monic orthogonal polynomials {Q n (x)} has been studied by Marcellán et al. (J. Comput. Appl. Math. 71 (1996) 24...

متن کامل

Zeros of Gegenbauer and Hermite polynomials and connection coefficients

In this paper, sharp upper limit for the zeros of the ultraspherical polynomials are obtained via a result of Obrechkoff and certain explicit connection coefficients for these polynomials. As a consequence, sharp bounds for the zeros of the Hermite polynomials are obtained.

متن کامل

Computation of connection coefficients and measure modifications for orthogonal polynomials

We observe that polynomial measure modifications for families of univariate orthogonal polynomials imply sparse connection coefficient relations. We therefore propose connecting L2 expansion coefficients between a polynomial family and a modified family by a sparse transformation. Accuracy and conditioning of the connection and its inverse are explored. The connection and recurrence coefficient...

متن کامل

Connection Coefficients of Orthogonal Polynomials with Applications to Classical Orthogonal Polynomials

New criteria for nonnegativity of connection coefficients between to systems of orthogonal polynomials are given. The results apply to classical orthogonal polynomials.

متن کامل

Multiplicity of Zeros and Discrete Orthogonal Polynomials

We consider a problem of bounding the maximal possible multiplicity of a zero of some expansions ∑ aiFi(x), at a certain point c, depending on the chosen family {Fi}. The most important example is a polynomial with c = 1. It is shown that this question naturally leads to discrete orthogonal polynomials. Using this connection we derive some new bounds, in particular on the multiplicity of the ze...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2001

ISSN: 0377-0427

DOI: 10.1016/s0377-0427(00)00653-1